Algorithms for Max Hamming Exact Satisfiability
نویسنده
چکیده
We here study Max Hamming XSAT, ie, the problem of finding two XSAT models at maximum Hamming distance. By using a recent XSAT solver as an auxiliary function, an O(1.911^n) time algorithm can be constructed, where n is the number of variables. This upper time bound can be further improved to O(1.8348^n) by introducing a new kind of branching, more directly suited for finding models at maximum Hamming distance. The techniques presented here are likely to be of practical use as well as of theoretical value, proving that there are non-trivial algorithms for maximum Hamming distance problems.
منابع مشابه
New algorithms for Exact Satisfiability
The Exact Satisfiability problem is to determine if a CNFformula has a truth assignment satisfying exactly one literal in each clause; Exact 3-Satisfiability is the version in which each clause contains at most three literals. In this paper, we present algorithms for Exact Satisfiability and Exact 3-Satisfiability running in time O(20.2325n) and O(20.1379n), respectively. The previously best al...
متن کاملMaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of clauses in a Boolean formula. A branch and bound algorithm based on the Davis-Putnam-Logemann-Loveland procedure (DPLL) is one of the most competitive exact algorithms for solving max-SAT. In this paper, we propose an...
متن کاملImproved Exact Algorithms for MAX-SAT
In this paper we present improved exact and parameterized algorithms for the maximum satisfiability problem. In particular, we give an algorithm that computes a truth assignment for a boolean formula F satisfying the maximum number of clauses in time O(1.3247|F |), where m is the number of clauses in F , and |F | is the sum of the number of literals appearing in each clause in F . Moreover, giv...
متن کاملCombining a Unit Propagation with Genetic Algorithms to Solve max-SAT Problems
In this paper, we propose and investigate a new strategy for max-SAT problems. The proposed approach consists of a unit propagation strategy combined with a genetic algorithm. Based on the two strategies, we hope to propose an exact solver for max-SAT. The principal goal is to reduce the run-time of the unit propagation – based exact method. The latter is applied on partial assignments with few...
متن کامل